Multi-matrix verifiable computation
نویسندگان
چکیده
منابع مشابه
Stateful Multi-Client Verifiable Computation
This paper develops a cryptographic protocol for outsourcing arbitrary stateful computation among multiple clients to an untrusted server, while guaranteeing integrity of the data. The clients communicate only with the server and store only a short authenticator to ensure that the server does not cheat. Our contribution is two-fold. First, we extend the recent hash&prove scheme of Fiore et al. ...
متن کاملMulti-User Non-Interactive Verifiable Computation
Gennaro et al. (Crypto 2010) introduced the notion of verifiable computation, which allows a computationally weak client to outsource the computation of a function F on dynamically chosen inputs x1, . . . , x` to a more powerful but untrusted server. Following a pre-processing phase (that is only carried out once), the client can send some representation of its input xi to the server; the serve...
متن کاملMulti-Client Non-interactive Verifiable Computation
Gennaro et al. (Crypto 2010) introduced the notion of noninteractive verifiable computation, which allows a computationally weak client to outsource the computation of a function f on a series of inputs x, . . . to a more powerful but untrusted server. Following a preprocessing phase (that is carried out only once), the client sends some representation of its current input x to the server; the ...
متن کاملVerifiable Multi-party Computation with Perfectly Private Audit Trail
We propose an efficient protocol for the evaluation of functions getting their inputs from multiple parties in a way that guarantees the result correctness. In our setting, a worker is trusted with the confidentiality of the inputs and, given this assumption, our protocol guarantees perfect privacy to the clients. Our protocol offers an interesting middle ground between traditional verifiable c...
متن کاملHybrid Publicly Verifiable Computation
Publicly Verifiable Outsourced Computation (PVC) allows weak devices to delegate computations to more powerful servers, and to verify the correctness of results. Delegation and verification rely only on public parameters, and thus PVC lends itself to large multi-user systems where entities need not be registered. In such settings, individual user requirements may be diverse and cannot be realis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cluster Computing
سال: 2020
ISSN: 1386-7857,1573-7543
DOI: 10.1007/s10586-020-03116-z